A note on the Ramsey number and the planar Ramsey number for C4 and complete graphs
نویسنده
چکیده
We give a lower bound for the Ramsey number and the planar Ramsey number for C4 and complete graphs. We prove that the Ramsey number for C4 and K7 is 21 or 22. Moreover we prove that the planar Ramsey number for C4 and K6 is equal to 17.
منابع مشابه
All Ramsey (2K2,C4)−Minimal Graphs
Let F, G and H be non-empty graphs. The notation F → (G,H) means that if any edge of F is colored by red or blue, then either the red subgraph of F con- tains a graph G or the blue subgraph of F contains a graph H. A graph F (without isolated vertices) is called a Ramsey (G,H)−minimal if F → (G,H) and for every e ∈ E(F), (F − e) 9 (G,H). The set of all Ramsey (G,H)−minimal graphs is denoted by ...
متن کاملZarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملA Note on Planar Ramsey Numbers for a Triangle Versus Wheels
We assume that the reader is familiar with standard graph-theoretic terminology and refer the readers to Bondy and Murty (2008) for any concept and notation that is not defined here. In this paper, we consider simple, undirected graphs. Given two graphsG andH , the Ramsey numberR(G,H) is the smallest integer n such that every graph F on n vertices contains a copy of G, or its complement F conta...
متن کاملPlanar Ramsey Numbers for Small Graphs
Given two graphs G1 and G2, the planar Ramsey number PR(G1, G2) is the smallest integer n such that every planar graph on n vertices either contains a copy of G1 or its complement contains a copy of G2. So far, the planar Ramsey numbers have been determined, when both, G1 and G2 are complete graphs or both are cycles. By combining computer search with some theoretical results, in this paper we ...
متن کاملBounds on Some Ramsey Numbers Involving Quadrilateral
Xiaodong Xu, Guangxi Academy of Sciences, Nanning, China Zehui Shao, Huazhong University of Science and Technology, Wuhan, China Stanis law Radziszowski∗, Rochester Institute of Technology, NY, USA For graphs G1, G2, · · · , Gm, the Ramsey number R(G1, G2, · · · , Gm) is defined to be the smallest integer n such that any m-coloring of the edges of the complete graph Kn must include a monochroma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 19 شماره
صفحات -
تاریخ انتشار 1999